Padé Approximations to the Logarithm Ii: Identities, Recurrences, and Symbolic Computation
نویسنده
چکیده
Combinatorial identities that were needed in [24] are proved, mostly with C. Schneider’s computer algebra package Sigma. The form of the Padé approximation of the logarithm of arbitrary order is stated as a conjecture.
منابع مشابه
Padé Approximations to the Logarithm Iii: Alternative Methods and Additional Results
We use C. Schneider’s summation software Sigma and a method due to AndrewsNewton-Zeilberger to reprove results from [5] and [24] as well as to prove new related material.
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملLook-ahead Levinson- and Schur-type Recurrences in the Padé Table∗
For computing Padé approximants, we present presumably stable recursive algorithms that follow two adjacent rows of the Padé table and generalize the well-known classical Levinson and Schur recurrences to the case of a nonnormal Padé table. Singular blocks in the table are crossed by look-ahead steps. Ill-conditioned Padé approximants are skipped also. If the size of these lookahead steps is bo...
متن کاملA new method for obtaining Fibonacci identities
For the Lucas sequence {Uk(P,Q)} we discuss the identities like the well-known Fibonacci identities. For example, the generalizations of F2k = F 2 k+1 − F 2 k−1 and F2k+1 = F 2 k+1 + F 2 k are PU2k = U 2 k+1 − QU k−1 and U2k+1 = U k+1 − QU k , respectively. We propose a new simple method for obtaining identities involving any recurrences and use it to obtain new identities involving the Fibonac...
متن کاملDetection of Recurrences in Sequential Programs with Loops
To improve the performances of parallelizing compilers, one must detect recurrences in scientiic programs and subject them to special parallelization methods. We present a method for detecting recurrences which is based on the analysis of Systems of Recurrence Equations. This method identiies recurrences on arrays, recurrences of arbitrary order and multi-equations recurrences. We explain how t...
متن کامل